Linear logic and elementary time
نویسندگان
چکیده
منابع مشابه
Linear Logic & Elementary Time
Think of elementary linear logic as an idealized functional programming language with a severe typing mechanism. Definition by recursion is, of course, forbidden, but some sort of iteration still is possible and the purpose of this paper is to show that enough computing power remains so that elementary recursive functions can be implemented. Actually, the whole paper can be considered an exerci...
متن کاملLinear logic and elementary time
A subsystem of linear logic, elementary linear logic, is defined and shown to represent exactly elementary recursive functions. Its choicest part consists in reducing the deductive power of the exponential, also known as the ‘‘bang,’’ which, in linear logic, is in charge of controlling duplication in the cut-elimination process. 2003 Elsevier Science (USA). All rights reserved.
متن کاملOn Elementary Linear Logic and polynomial time
Linear logic (LL) [Gir87] has been used in implicit computational complexity to characterize various complexity classes within the proofs-as-programs approach. This can then be the basis of type systems to guarantee complexity properties on lambda-calculus. As duplication is controlled in LL by the connective ! the key idea of this line of work is to consider variants of this system with a weak...
متن کاملRemarks on Elementary Linear Logic
Last works in linear logic mark a trend that can be summarized as: studying of fragments of calculi which have good logical properties and a quite powerful class of representable functions. ELL is a system derived from linear logic which presents several of such good properties: rst of all a bound of the cut-elimination procedure which is lower w.r.t. the usual one.
متن کاملElementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions, that is to say computable in time bounded by a tower of exponentials of fixed height. Our goal here is to show that despite its simplicity, elementary linear logic can nevertheless be used as a common framework to charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00010-5